The Logic of Anaphora Resolution
نویسنده
چکیده
This paper concerns the semantics/pragmatics interface for natural language, and in particular the question of how anaphora resolution should be orchestrated in a dynamic semantics. Previous dynamic systems such as DPL have relied on preindexation of anaphors and antecedents. It is argued that this represents a serious inadequacy. A dynamic semantic system, RPL, is proposed which eliminates the need for preindexation, by combining an “Amsterdam-style” dynamic semantics with a pragmatic module. The semantics uses a novel extension of DMPL information states, in which ambiguity of anaphors is represented using multiple referent systems. It is argued that the resulting system not only provides a marked empirical improvement over dynamic predecessors, but also provides a quite general approach to the semantics/pragmatics interface.
منابع مشابه
Anaphora resolution and minimal models
Some anaphora resolution algorithms are based on model builders, and use the fact that they generate minimal models: only those elements that are necessary are postulated to exist in the model. In this way, such systems have the desirable property that if anaphora can be resolved to a linguistically available antecedent, this resolution applies, and only if there is no suitable antecedent, a de...
متن کاملExploiting Syntactic Patterns as Clues in Zero-Anaphora Resolution
We approach the zero-anaphora resolution problem by decomposing it into intra-sentential and inter-sentential zeroanaphora resolution. For the former problem, syntactic patterns of the appearance of zero-pronouns and their antecedents are useful clues. Taking Japanese as a target language, we empirically demonstrate that incorporating rich syntactic pattern features in a state-of-the-art learni...
متن کاملAnaphora resolution and reambiguation∗
Starting off from common assumptions on the relationship between ambiguity and the process of disambiguation with regard to the technique of underspecification, we argue that disambiugation may be viewed as non-monotonic in nature in certain cases involving anaphora resolution. We then go on to present a formal analysis framed in a coupling of Discourse Representation Theory and Constraint Logi...
متن کاملAnaphora Resolution in Japanese Sentences Using Surface Expressions and Examples
Anaphora resolution is one of the major problems in natural language processing. It is also one of the important tasks in machine translation and man/machine dialogue. We solve the problem by using surface expressions and examples. Surface expressions are the words in sentences which provide clues for anaphora resolution. Examples are linguistic data which are actually used in conversations and...
متن کاملAnaphora Resolution – What Helps in German
Although anaphora resolution has been a very active research area throughout the last decades, there exist only a few studies that focus on German anaphora. Strube and Hahn (1999) present a system for anaphora resolution for German based on an extension of Centering Theory. Müller et al. (2002) and Kouchnir (2003) use co-training and boosting, respectively. Hinrichs et al. (2005) employ a hybri...
متن کاملA type-theoretic approach to anaphora and ellipsis resolution
We present an approach to anaphora and ellipsis resolution in which pronouns and elided structures are interpreted by the dynamic identification in discourse of type constraints on their semantic representations. The content of these conditions is recovered in context from an antecedent expression. The constraints define separation types (sub-types) in Property Theory with Curry Typing (PTCT), ...
متن کامل